Distributed approximate k-core decomposition and min–max edge orientation: Breaking the diameter barrier
نویسندگان
چکیده
منابع مشابه
Brief Announcement: Distributed k–Core Decomposition∗
In the last few years, a number of metrics and methods have been introduced for studying the relative “importance” of nodes within complex network structures [6]. Among these metrics, k-core decomposition is a well-established method for identifying particular subsets of the graph called k-cores, or k-shells [7]. Informally, a k-core is obtained by recursively removing all nodes of degree small...
متن کاملDistributed Strong Diameter Network Decomposition
For a pair of positive parameters D,χ, a partition P of the vertex set V of an n-vertex graph G = (V,E) into disjoint clusters of diameter at most D each is called a (D,χ) network decomposition, if the supergraph G(P), obtained by contracting each of the clusters of P , can be properly χ-colored. The decompositionP is said to be strong (resp., weak) if each of the clusters has strong (resp., we...
متن کاملBreaking the GOP/Watt Barrier with EDGE Architectures
Achieving excellent power/performance ratios is easy for processor designs that have sufficiently low performance needs. The techniques traditionally used to extract higher levels of performance from RISC or CISC architectures, however, have either exacerbated power limitations or placed an undue burden on the programmer. In this paper, we describe how Explicit Data Graph Execution (EDGE) archi...
متن کاملBreaking the k Barrier for Explicit RIP Matrices
Jean Bourgain School of Mathematics Institute for Advanced Study Princeton, NJ 08540 [email protected] S. J. Dilworth Department of Mathematics University of South Carolina Columbia, SC 29208 [email protected] Kevin Ford Department of Mathematics University of Illinois Urbana, IL 61801 [email protected] Sergei V. Konyagin Steklov Mathematical Institute 8 Gubkin Street Moscow, 119991, Ru...
متن کاملStreaming Algorithms for k-core Decomposition
A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-Hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2021
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2020.08.010